Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution
نویسندگان
چکیده
We concentrate here on decomposition of 2D objects into meaningful parts of visual form, or visual parts. It is a simple observation that convex parts of objects determine visual parts. However, the problem is that many significant visual parts are not convex, since a visual part may have concavities. We solve this problem by identifying convex parts at different stages of a proposed contour evolution method in which significant visual parts will become convex object parts at higher stages of the evolution. We obtain a novel rule for decomposition of 2D objects into visual parts, called the hierarchical convexity rule, which states that visual parts are enclosed by maximal convex (with respect to the object) boundary arcs at different stages of the contour evolution. This rule determines not only parts of boundary curves but directly the visual parts of objects. Moreover, the stages of the evolution hierarchy induce a hierarchical structure of the visual parts. The more advanced the stage of contour evolution, the more significant is the shape contribution of the obtained visual parts. c © 1999 Academic Press
منابع مشابه
Discrete, nonlinear curvature-dependent contour evolution
There has been much recent interest in curvature-dependent contour evolution, particularly when the resultant family of contours satisfies the heat (diffusion) equation. Modeling the evolution of a shape's boundary as a real-valued solution to the reaction-diffusion equation has been shown to be useful for shape decomposition [3]. This approach to contour evolution involves solving a partial di...
متن کاملToward Perception-Based Shape Decomposition
The aim of this work is to decompose shapes into parts which are consistent to human perception. We propose a novel shape decomposition method which utilizes the three perception rules suggested by psychological study: the Minima rule, the Short-cut rule and the Convexity rule. Unlike the previous work, we focus on improving the convexity of the decomposed parts while minimizing the cut length ...
متن کاملConvex Decomposition And Efficient Shape Representation Using Deformable Convex Polytopes
Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a parametric implicit shape model called Disjunctive Normal Shape Model (DNSM). The DNSM is formed as a union of polytopes which themselves are formed by intersections ...
متن کاملPAPANELOPOULOS, AVRITHIS: PLANAR SHAPE DECOMPOSITION MADE SIMPLE 1 Planar shape decomposition made simple
We present a very simple computational model for planar shape decomposition that naturally captures most of the rules and salience measures suggested by psychophysical studies, including the minima and short-cut rules, convexity, and symmetry. It is based on a medial axis representation in ways that have not been explored before and sheds more light into the connection between existing rules li...
متن کاملRecognition of Shapes for Object Retrieval in Image Databases by Discrete Curve Evolution
This paper presents the recognition of shapes for object retrieval in image databases using skeleton-based and contour-based representation by discrete curve evaluation and two consecutive primitive edges. Humans tend to use high-level concepts in everyday life. Object segmentation and recognition is the primary step of computer vision to achieve image retrieval of high-level image analysis. Co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Vision and Image Understanding
دوره 73 شماره
صفحات -
تاریخ انتشار 1999